Method for computer-supported control of production processes

ABSTRACT

The invention relates to a method for the computer-supported control of several production processes, overlapping in time and space, in particular construction processes. The aim of the invention is to describe a method for the computer-supported control of several production processes, overlapping in time and space, in particular construction processes, which permits a good exploitation of the capacity of a data processing unit with high flexibility. Said aim is achieved, whereby modifiable capacity descriptions are formulated in data sets for a second time in at least one further databank in a standardized data format according to capacity units (LE  1    . . . n ), whereby the capacity units (LE) have at least one databank reference and the databanks in the data format according to capacity positions (LV  1    . . . n ) have a relationship with the databanks in the data format according to capacity units (LE) in such a way that the data of capacity positions (LV) is bidirectionally linked thereto. Said capacity units (LE), corresponding to the progress of the capacity phases, may be altered whilst retaining the connectivity to the data of the capacity positions (LV) and the capacity descriptions (LB) may also be processed and represented in a manner based on the data format according to capacity units (LE) in the various input and output formats of the input and output units in the data processing unit (DVA).

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of International Patent ApplicationNo. PCT/DE03/02531 filed Jul. 28, 2003, which claims priority to GermanPatent Application No. 2102 34 327.6 filed Jul. 26, 2002, both of whichapplications are hereby incorporated by reference in their entiretiesherein.

FIELD OF THE INVENTION

The invention relates methods for computer control of manufacturingprocesses. In particular the invention relates to methods for computercontrol of a plurality of temporally and spatially interlockingmanufacturing processes.

BACKGROUND OF THE INVENTION

Conventionally, construction operations of any kind are divided intoconstruction steps and described by a multitude of performancepositions, each containing a representation of the performance to becarried out. These performance positions must be worked off successivelyas well as parallel with each other, until the respective constructionstep has been completed.

Since the organization of construction operations is extremelycomplicated, if only because of the variety of works, various attemptshave been made to achieve an improvement by means of suitable software.However, it has been found that the simple imaging of a constructionoperation by a suitable software will not function because of thecomplex structure of a construction operation and the continual changesthat are actually on the order of the day. Therefore, the softwaresupport has heretofore been utilized only for individual constructionsegments or phases of performance.

For more extensive construction operations, project control programs,whose program advance is extremely linear and requires input of detaileddata, are also employed. Changes in the course of construction lead to acostly program revision in all performance positions in such programs,since even the slightest change will affect all subsequent performancepositions. The reason for this lies in the rigid project control.

This means that changes in the course of construction can be realizedonly through manual changes in the project control, and hence theperformance capacity of a data processing system cannot be utilizedbatch wise. See e.g., Bauprojektmanagement Terminplanung mit System fürArchitekten und Ingenieure, Verlag Rudolf Müller, Cologne 1994.

Another example is the so-called network planning technique. The basisof this is simulation of the planned construction operation. The networkplanning technique is employed for complex projects with their numerousinternal and external dependencies, so that the planning of the entirecourse of the project can be carried out. See e.g. ModernesProjektmanagement, 6th ed., Verlag Vieweg, Brunswick/Wiesbaden, 1999.

With the network planning technique, it is possible to determine theentire course of the sequence of operations governing a constructionproject in advance, with consideration of all dependencies. In thisrather rigidly preassigned planning, those operations which lie on thecritical path are made known beforehand. At the same time, in such aplanning technique, so-called buffer zones are obtained for thenon-critical operations, determining those periods of time within whichthe non-critical operations can be shifted. This ensures that theshifting of non-critical operations will not affect the total durationof the project or any partial step.

But if an essential construction performance fails, or if it becomesnecessary to shift a critical operation, there is danger that the totalnetwork planning will have to be re-worked manually, with theconsequence of displacing the schedule as a whole.

So it turns out that while network planning makes possible a detailedfine planning, but on the whole represents a very rigid scheme which isdifficult to handle in practice. The reason for this is to be found inthat network planning technique represents a forward-oriented,comparatively rigid planning.

This manifests itself clearly in the customary forms of representationof network plans, namely the process arrow networks (activity oriented)and the process node networks. In the case of the latter, it ischaracteristic that for like initial and final terminals, two or moreoperations must be introduced for clear identification of so-calledvirtual processes.

In order to be able to achieve such a network planning technique withthe aid of a computer-supported project management, after definition ofthe project aim and delimitation of the project mission the partialactivities required to resolve the project and the dependencies amongthe several partial activities must be determined.

For that purpose, independently of the program introduced, in principlethe following partial steps must be worked off in order to realizeproject planning and control by means of a data processing system. Theseare the detection of the project structure, the coordination of theproject calendar, and the detection of the planning times, assignment ofresources (technology, labor, finances etc.) as well as inputting thecosts of the resources deployed.

By means of these inputs, a project management program can easily carryout numerous calculations and compute a detailed project plan from them.The results of this calculation may be lists of operations, timeprograms, cost programs, implementation plans and diagrams in the formof bar and network plans.

The detection of the data here takes place in at least one data bankusing tables or input masks, which then furnish the data for calculatingthe project plan. In the same way, the actual data are then detectedduring the construction operation in this data bank.

When the project is started, the task range of the project controlprogram shifts to the monitoring and control of the project by advancingthe initial and final deadlines and verifying the performance,allocation of resources, costs actually incurred and the target-actualcomparison.

It is easily seen that interferences with the established network plan,especially in the case of critical operations, will lead to considerableexpenditures on revision of the network plan with the unavoidableconsequence of postponing the final deadline. In particular, this leadsto a considerable burdening of the data processing system withadditional calculations, which always become required only afteroccurrence of the interference, or at least recognition of theinterference. An advance calculation of the influence of possibleinterferences is quite impossible.

The network planning technique is used for singular manufacturingoperations. Such singular manufacturing processes do indeed have strongto very strong accidental factors. For this reason, a detailed planningas provided in the network planning techniques is frequently in vain, ashas already been explained.

Consideration is now being to ways of improving computer control ofinterelated manufacturing processes. In particular attention is directedto improving methods of computer-supported control of a plurality oftemporally and spatially interlocking manufacturing processes.

SUMMARY OF THE INVENTION

The invention provides a method for computer supported control of aplurality of temporally and spatially interlocking manufacturingprocesses. The inventive method provides control of the manufacturingprocesses on the basis of performance descriptions which may be updatedover an arbitrary number of performance phases. The method may beimplemented using a data processing system equipped with at least onestorage unit and associated input and output units. The performancedescriptions of the manufacturing processes are deposited in at leastone data bank in a data format, data set by data set according toperformance positions, and on the basis of this data format, theperformance descriptions can be represented and processed in the inputand output units in various input and output formats to provide control.

An object of the invention is to create a procedure forcomputer-supported control of several temporally and spatiallyinterlocking manufacturing operations, that, with high flexibility,makes possible an advance calculation of the influence of possibleinterferences and permits a good utilization of the performance capacityof a data processing system.

The problem underlying the invention, in the case of a method ofcontrolling a plurality of temporally and spatially interlockingmanufacturing operations, in particular construction operations, on thebasis of performance descriptions updateable over an arbitrary number ofperformance phases, using a data processing system equipped with atleast one storage unit and associated input and output units, in whichthe performance descriptions are deposited in at least one data bankaccording to performance items, data set by data set, and on the basisof this data format, the performance descriptions are represented andprocessed in various input and output formats in the input and outputunits, is solved in that the advanceable performance descriptions areformulated a second time in at least one additional data bank in astandardized data format, data set by data set, by performance units,said performance units comprising at least one data bank reference, suchas works, time, location and resource reference, operation-specifically,and the data bank stand in data format by performance position with thedata banks in data format according to performance units, in suchinterrelationship that the data of the performance items are completelycoordinated in partial quantities with an arbitrary number ofperformance units, and are linked to these bidirectionally, theseperformance units being variable according to the progress of theperformance phases while retaining links with the data of theperformance items, and the performance descriptions are also processableand representable on the basis of the data format according toperformance units in the various input and output formats of the inputand output units of the data processing system.

The performance units are preferably grouped hierarchically and arearbitrarily variable in number, the data of the performance items beingcompletely coordinated with the altered number of performance units andlinked to the latter bidirectionally.

In continuation of the invention, the content and scope of theperformance units is arbitrarily variable, the data of the performanceitems being completely coordinated with the altered performance unitsand bidirectionally linked to them. Only thus can the full function ofthe method be guaranteed.

Furthermore, the content, scope and subdivision of the data of theperformance items is variable without problems, the altered data of theperformance items being completely coordinated with the existingperformance units and linked to them bidirectionally.

Another embodiment of the invention provides that according to theperformance phases, the performance units in subordinate claims aresubdivided into partial performance units, the data of the partialperformance units being completely coordinated with the performanceunits of the superordinate plane and bidirectionally linked with them,the scope of the partial performance units being arbitrarily variablewhile retaining the links with the data of the superordinate performanceunits.

In particular, the partial performance units are modifiable according tothe performance phases in their data bank reference, such as works,time, place and resource reference.

The partial performance units can be taken over in an output format inthe form of a pre-protocol, this output format being immediatelyimageable in the output medium.

Further, partial performance units of the pre-protocol are definable asreference quantities in the form of a target status, the partialperformance units defined as reference quantities being assumable in anoutput format in the form of a protocol and this being imageable in theoutput medium.

The daily reports may advantageously be augmented within the input unitwith data of the reported performances.

Finally, the partial performance units defined as reference quantitiesare compared by the data processing unit with the data of the reportedperformances in the data bank and the results documented by way of theoutput medium.

The partial performance units defined in the target status as referencequantities can be taken over with the data of the reported performancesin an output format in the form of a check list and are imageable in theoutput medium, where the control lists can be supplemented within theinput unit with data of actual performances.

In a further embodiment of the invention, the controlling of theperformances of the executant with the aid of the target and actualstatus of the partial performance units takes place analytically in thedata banks, the results being documentable by way of the output medium.

In particular, the results of the controlling of the target and actualstatus of the partial performance units of the daily reports arecompared with those of the control lists.

Another special embodiment of the invention is characterized in that, byway of a data feedback from the target and actual status of the partialperformance units to the items of the contractual performances, withtheir prices, the state of fulfillment of contractual performances andthe calculable costs in each performance phase are determinable anddocumentable by way of the output medium.

Besides, the calculations of the fulfilled contractual performances bythe executant are detectable as costs by way of the input unit,comparable by data reference to the calculable costs, and the resultsdocumentable by way of the output medium.

Finally, the results in the data banks receive a defined reference topre-formulated measures, so that the latter can be represented in anoutput medium in transaction-corresponding form.

By the linkage according to the invention of an arbitrary number ofperformance items with an arbitrary number of hierarchically groupedperformance units and the constant retention of the linkage, with thepossibility of arbitrary augmentation of performance units, with newlinkage required in that event, the comprehensive control of complexoperations is possible. Through the invention, the effective employmentof a data processing system to control manufacturing processes, inparticular construction procedures, is made possible for the first time.

By the new method here presented, the accidental nature in theindividual singular manufacturing processes is accepted, and therequirements on the degree of detailing in planning are limited to whatis necessary and available on information.

The data-technical postulate here is that the product descriptionsdefined independently of each other on the one hand and the performancedescription on the other hand are linked, where

-   -   The definitions of the result of the manufacturing operation in        the form of a location structure for the work piece, in the form        of a parts list for an arbitrary prototype, such as component        group, component part and single parts etc. as hierarchically        structured description, and    -   The performance of supplying the product (i.e. the result of the        manufacturing operation) is likewise provided as hierarchically        structured description.

By the connection of individual elements of these two hierarchicalstructures in almost arbitrary form, the operations of the manufacturingprocess are produced. These may be formulated and expanded to arelatively arbitrary extent, and owing to the hierarchical arrangementof the reference data, they can be flexibly, quickly and, adapted inaccordance with concrete requirements, continued and even defined. Thelist of procedures, as required, in view of the current structure of theoriginal elements, should also be hierarchically articulated. Anessential point to be considered is the separation for the first time ofhierarchical structures of performance units from the hierarchical localstructures, that is, the separation of product and performance.

Into these data structures, known planning and estimating data can beincorporated.

This satisfies the technical prerequisite for incorporating importantplanning simplification, optimization and integration of information instochastic processes of a singular manufacturing operation.

The first phase of production planning may thus be substantiallylimited, unlike network planning, to the description of the result ofproduction as available at the commencement of manufacture. Owing to thehierarchical structure of the product result, all other detailedinformation can be hung on this hierarchical structure, withoutalteration or recommencement of planning. The instantaneous key data areretained, both temporally and financially. Planning can be kept verycoarse, very considerably reducing the planning outlay.

In the second step of planning, the required performances can be definedand connected to the current product/part. In so doing, the existingestimating, budget and contractual data are tied in.

Until commencement of production, therefore, a complex planning/dataroster, complex but simple to prepare, integrating the existingestimating and assignments, has been created. The detailing has beencarried only as far as the information has come in. Detailed informationinsofar as required and available, has been integrated in the coarseroster of the parts lists. In the regular case, costs, deadlines etc.have been only roughly calculated.

Essential control elements for the execution of singular manufacturingprocesses are the so-called “Jour fixe” (i.e., a regularly scheduledmeeting day or time). On these days or times, the operations in theprocesses of production are discussed and fixed in detail. For theseJour fixe, all thitherto available information for the organization ofthe manufacturing process is presented in structured and adapted form inthe so-called presentation protocol. This information is reduced to theshort-term planning horizon of the Jour fixe. This provides all relevantoperations with concrete binding time data. Besides rough planning, thisproduces a second level of short-term planning, binding by agreement onall concerned (protocol). Other information, either from thedeclarations or from amendments or from new discoveries which naturallymake out a major portion of the Jour fixe, are integrated into theexisting data structure. The knowledge or agreements recorded here areset up in the data-bank-supported protocol.

Aside from the high flexibility and integration of new operations in theexisting data structure without other special outlay, the decisiveadvantage of this method is that the usual descriptions of the projectparticipants can be used for their operation, thus achieving a highdegree of understanding and commitment. This colloquially accurate,data-bank-technically inaccurate information is effectively and usefullyemployable in the existing data structure, through integration by meansof protocol determinations.

With this technology, it is brought about that an existing, naturallycoarse planning is detailed only to match requirements. The planningoutlay is thereby reduced to what is required, and at the same timeconcretized for those concerned in their language. Over all, thisreduces planning outlay and preserves the requisite flexiblepossibilities. Planning is thereby rendered timely, conclusive (recordedin the protocol), sufficiently detailed and secure (discussed with thoseconcerned).

This planning, constantly improved automatically according to theinvention, can be employed by simple means and without expense forcontrolling (time limits, costs, quality) in the production operation,and documented accordingly. Technically, this is done with thedaily/weekly reports (or reports with freely definable patterns),control lists of all kinds, clarification lists, semi-automatedpostponements etc. The existing data bank permits an automatedaccounting without additional extra costs.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features of the invention, its nature, and various advantageswill be more apparent from the following detailed description and theaccompanying drawings, wherein like reference characters represent likeelements throughout, and in which:

FIG. 1 is a schematic block diagram of an arrangement for practicing themethod in accordance with principles of the present invention;

FIG. 2 is a schematic representation of the coordination of LV itemswith LE performance units in accordance with principles of the presentinvention;

FIG. 3 is a schematic illustration of the reference of the performanceunits (LE) to the conventional estimating and contractual data;

FIG. 4 is a schematic illustration of the reference of the performanceunits (LE) to conventional estimating and contractual data-schematicrepresentation of course of work (pre-planning);

FIG. 5 is a schematic illustration of the reference a continuation ofFIG. 3 (work planning);

FIG. 6 is a schematic illustration of a continuation of FIG. 4(preparation of object performance);

FIG. 7 is a schematic illustration of a continuation of FIG. 5 (objectperformance); and

FIG. 8 is a schematic illustration of an example of content ofperformance units.

The following list is an index of the reference characters or numeralsthat are used in FIGS. 1-8 and in the following detailed description torefer to particular drawing elements. List of Reference Symbols LB (1 ton) performance unit LV (1 to n) performance item TLE partial performanceunit AF output format AM output medium E input unit DB data bank DRBdata bank feedback LB performance description DVA data processing systemVP pre-protocol TM daily report KL control list EM input medium

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

The process according to the invention, which may be employed for thecontrol of any manufacturing process, will be illustrated in more detailby an example of the control of building operations. For that purpose,first on the basis of performance descriptions updateable over anarbitrary number of performance phases, according to performance itemsLV (1 to n) data set by data set, in a preassigned data format, aredeposited in a data bank DB.

These performance descriptions may be represented and processed on thebasis of this data format in various input formats EF and output formatsAF in the input media EM and output media AM.

FIG. 1 shows a schematic block diagram of an apparatus for practicingthe method of computer-supported control of manufacturing processesusing a data processing system DVA equipped with a storage unit in theform of a first and a second data bank DB and associated input andoutput media EM, AM, the input medium EM comprising an input unit E(keyboard, touch pad or the like). The data banks DB and the outputmedium AM (screen, printer, list) are connected to each otherbidirectionally in each instance in order to provide a data feedbackDRB, the output medium AM being associable with an additional input unitE (shown dotted in FIG. 1).

The updateable performance descriptions are then deposited, formulateddata set by data set, according to performance units (LE 1 to n), theperformance units LE comprising at least one data bank reference such asworks, time, place or resource. The data banks DB in data formataccording to performance items LV (1 to n) are so interrelated with thedata banks DB in data format according to performance units LE that thedata of the performance items LV, subdivisible into parts of anarbitrary number of performance units LE are completely coordinated andbidirectionally linked to the latter. These performance units LEcorrespond to the advance of the performance phases, retaining the linkswith the data of the performance items LV, and are continuouslyvariable. The performance descriptions LB are also processable andrepresentable (FIGS. 2, 3) on the basis of the data format byperformance units LE in the various input and output formats of theinput and output units of the data processing system DVA.

The performance units LE are hierarchically grouped and arbitrarilyvariable in number. A special advantage of the method according to theinvention is that the content and scope of the performance units LE isarbitrarily variable, the data of the performance items LV of thealtered performance units LE being completely coordinated and linkedbidirectionally to the latter. A complete overview is shown in FIGS. 4to 7.

Furthermore, the content, scope and subdivision of the data of theperformance units LV is divisible into partial performance units TLE(FIG. 8), the altered data of the performance items LV being completelycoordinated with the existing performance units LE and linked to thembidirectionally.

The performance units LE are subdivided according to the performancephases into subordinate planes of partial performance units TLE, thepartial performance units TLE being completely coordinated with theperformance units LE of the superordinate plane and bidirectionallylinked to them. It is essential that the content and scope of thepartial performance units TLE are variable arbitrarily while retainingthe links with the data of the superordinate performance units LE, thepartial performance units TLE being adaptable without problems accordingto the performance phases in their data bank reference, such as works,time, place and resources.

The partial performance units TLE are imaged by the output medium AM inan output format AF in the form of a pre-protocol VP and imaged in theoutput medium AM.

In the pre-protocol VP, the partial performance units TLE are defined asreference quantities in the form of a target status. These referencequantities in the form of partial performance units TLE, defined in thetarget status, are taken over in the form of a protocol and imaged inthe output medium AM. Further, the reference quantities in the form ofpartial performance units TLE defined in the target status are takenover in an output format AF in the form of a daily report TM and imagedin the output medium AM or, at need, issued as a daily report to besupplemented by way of an input unit with data on the reportedperformances.

Finally, the reference quantities in the form of partial performanceunits TLE defined in the target status are imaged together with the dataof the reported performances in an output format AF in the form of acontrol list KL and imaged in the output medium AM.

The control lists KL are supplementable within the input unit E by dataof the actual performance defined as the actual status.

A specialty of the method according to the invention is to be seen inthat the controlling of the performances of the executant with the aidof the target and actual status of the partial performance units TLEtakes place analytically in the control lists KL in the data banks DB,and results are documented by way of the output medium AM.

The data reference feedback DRB to be seen in FIG. 1, from the targetand actual status of the partial performance units TLE to the items oftheir contractual performances with their prices permits a simplecontrol of the fulfillment status of the contractual performances andthe costs that can be settled at each performance phase and isdocumented continuously by way of the output medium AM.

The settlement for the fulfilled contractual performances of theexecutant are detectable by way of the input unit E or E′ as costs,comparable by data feedback DRB with the costs to be settled and theresults likewise documentable by way of the output medium AM, theresults in the data banks DB bearing a defined relationship topre-formulated measures, and these being represented on the outputmedium AM in transaction-corresponding form.

1.-20. (canceled)
 21. A method for controlling of several temporally andspatially interlocking manufacturing processes on the basis ofperformance descriptions which are updateable, wherein the control ofthe manufacturing processes can be continued over an arbitrary number ofperformance phases, the method comprising the steps of: using a dataprocessing system equipped with at least one storage unit and associatedinput and output units, in which the performance descriptions aredeposited in at least one data bank; depositing the performancedescriptions in a data format in which data is organized data set bydata set according to performance items (PV); on the basis of this dataformat, representing and processing the performance descriptions invarious input and output formats in the input and output units, whereinthe representing and processing comprises formulating the updateableperformance descriptions a second time; and depositing the updateableperformance descriptions that are formulated a second time in at leastone additional data bank in a standardized data format in which data isorganized data set by data set according to performance units (LE, 1 ton), wherein each performance unit (LE) comprises at least one data bankreference (such as works, time, place and resource, and production) thatis in a specific interrelationship with the data banks in the dataformat by performance unit (LE) so that the data of the performanceitems (LV) are subdivisible into subsets of an arbitrary number ofperformance units (LE) and so that the data of the performance items(LV) are completely coordinated with said performance units (LE) andbidirectionally linked with the same, wherein the number of performanceunits (LE) are variable according to the progress of the performancephases with retention of the links with the data of the performanceitems (LV), and wherein the performance descriptions (LB) areprocessable and representable on the basis of the data format byperformance units (LE) in the various input and output formats of theinput and output units of the data processing system (DVA).
 22. Themethod of claim 1 further comprising hierarchically grouping anarbitrarily variable number of performance units (LE), wherein the dataof the performance items (LV) of an altered number of performance units(LE) are completely coordinated and linked to the latterbidirectionally.
 23. The method of claim 1 wherein the content and scopeof the performance units (LE) is arbitrarily variable, and wherein thedata of the performance items (LV) is completely coordinated with thealtered performance units (LE) and bidirectionally linked to them. 24.The method of claim 1 wherein the content, scope and subdivision of thedata of the performance items (LV) is variable in partial performanceunits (TLE), and wherein the altered data of the performance items (LV)is completely coordinated with the existing performance units (LE) andbidirectionally linked to them.
 25. The method of claim 1 whereinaccording to the performance phases, the performance units (LE) aredivisible into subordinate planes in partial performance units (TLE),and wherein the data of the partial performance units (TLE) iscompletely coordinated with the performance units (LE) of thesuperordinate plane and bidirectionally linked to them.
 26. The methodof claim 24, wherein the content and scope of the partial performanceunits (TLE) is arbitrarily variable while retaining the links with thedata of the superordinate performance units (LE).
 27. The method ofclaim 24 wherein the partial performance units (TLE) are modifiableaccording to performance phases in their data bank reference (such asworks, time, place and resource reference).
 28. The method of claim 24wherein the partial performance units (TLE) is adopted in an outputformat (AF) in the form of a pre-protocol (VP), and wherein the outputformat (AF) is imageable in an output medium (AM).
 29. The method ofclaim 28 wherein the partial performance units (TLE) of the pre-protocol(VP) are defined as reference quantities in the form of a target status.30. The method of claim 29 wherein the partial performance units (TLE)defined as reference quantities in the form of target status are takenover in an output format (AF) in the form of a protocol, and the latteris imageable in the output medium (AM).
 31. The method of claim 29,wherein the partial performance units (TLE) defined as referencequantities in the form of target status are taken over in an outputformat (AF) in the form of daily reports (TM) and the latter areimageable in the output medium (AM).
 32. The method of claim 31 whereinthe daily reports (TM) are supplemented within the input unit (E) withdata of the reported performances.
 33. The method of claim 29 whereinthe partial performance units (TLE) defined as reference quantities inform of target status are analytically comparable to the data of thereported performances in the data banks (DB) and the results aredocumentable by way of the output medium (AM).
 34. The method of claim29 wherein the reference quantities defining the partial performanceunits (TLE) in form of target status are taken over with the data of thereported performances in an output format (AF) in the form of a controllist (KL) and the latter is imageable in the output medium (AM).
 35. Themethod of claim 34 wherein the control list (KL) is supplemented withinthe input unit (E) with data defined as actual status of the actualperformances.
 36. The method of claims 34 wherein control of theperformances of the executant takes place analytically by means of thetarget and actual status of the partial performance units (TLE) in thecontrol lists (KL) in the data banks (DB), and wherein the results aredocumentable by means of the output medium (AM).
 37. The method of claim36 wherein the results of the controlling of the target and actualstatus of the partial performance units (TLE) of the daily reports arecompared with those of the control lists (KL), and wherein the resultsare documentable by way of the output medium (AM).
 38. The method ofclaim 37 wherein by way of a data feedback (DRB) from the target andactual status of the partial performance units (TLE) to the items of thecontractual performances with their prices, the state of fulfillment ofthe contractual performances and the chargeable costs in eachperformance phase are determined and documented by way of the outputmedium (AM).
 39. The method of claim 38, wherein the accountings forfulfilled contractual performances of the executants are detected ascosts through the input unit (E), and compared in data feedback (DRB)with the costs to be settled, and the results are documentable by way ofthe output medium (AM).
 40. The method of claim 21 wherein the resultsin the data banks (DB) bear a defined relationship to pre-formulatedmeasures, and the latter are represented on the output medium (AM) intransaction-corresponding form.